Coreduction Homology Algorithm
نویسندگان
چکیده
A new reduction algorithm for the efficient computation of the homology of cubical sets and polotypes, particularly strong for low dimensional sets embedded in high dimensions, is presented. The algorithm runs in linear time. The paper presents the theoretical background of the algorithm, the algorithm itself, experimental results based on an implementation for cubical sets as well as some theoretical complexity estimates.
منابع مشابه
Coreduction Homology Algorithm for Regular CW-Complexes
In this paper we present a new algorithm for computing the homology of regular CW-complexes. This algorithm is based on the coreduction algorithm due to Mrozek and Batko and consists essentially of a geometric preprocessing algorithm for the standard chain complex generated by a CW-complex. By employing the concept of S-complexes the original chain complex can — in all known practical cases — b...
متن کاملThe Efficiency of a Homology Algorithm based on Discrete Morse Theory and Coreductions
Two implementations of a homology algorithm based on the Forman’s discrete Morse theory combined with the coreduction method are presented. Their efficiency is compared with other implementations of homology algorithms.
متن کاملCoreduction homology algorithm for inclusions and persistent homology
We present an algorithm for computing the homology of inclusion maps which is based on the idea of coreductions and leads to significant speed improvements over current algorithms. It is shown that this algorithm can be extended to compute both persistent homology and an extension of the persistence concept to two-sided filtrations. In addition to describing the theoretical background, we prese...
متن کاملComputing The Cubical Cohomology Ring
The goal of this work is to establish a new algorithm for computing the cohomology ring of cubical complexes. The cubical structure enables an explicit recurrence formula for the cup product. We derive this formula and, next, show how to extend the Mrozek and Batko [7] homology coreduction algorithm to the cohomology ring structure. The implementation of the algorithm is a work in progress. Thi...
متن کاملStatistical Topology Using the Nonparametric Density Estimation and Bootstrap Algorithm
This paper presents approximate confidence intervals for each function of parameters in a Banach space based on a bootstrap algorithm. We apply kernel density approach to estimate the persistence landscape. In addition, we evaluate the quality distribution function estimator of random variables using integrated mean square error (IMSE). The results of simulation studies show a significant impro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 41 شماره
صفحات -
تاریخ انتشار 2009